A Heuristic Method for Scheduling Band Concert Tours
نویسندگان
چکیده
منابع مشابه
A Heuristic Method for Scheduling Band Concert Tours
Scheduling band concert tours is an important and challenging task faced by many band management companies and producers. A band has to perform in various cities over a period of time, and the specific route they follow is subject to numerous constraints, such as: venue availability, travel limits, and required rest periods. A good tour must consider several objectives regarding the desirabilit...
متن کاملHeuristic Method for Optimum Shift Scheduling Design
This paper describes a method to schedule shifts in the most optimum way desire for today’s cost sensitive industries. The main problem for this domain is to make sure all shifts are assigned to cover all or maximum jobs available. The shifts also need to be schedule with the least manpower possible, avoid manpower idling during the shift and take into consideration employee’s time adaptability...
متن کاملA Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling
We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics compo...
متن کاملHeuristic Method for Decision-Making in Common Scheduling Problems
The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the algebraic-logical meta-model (ALMM), which enables making collective decisions in successive process stages, not separately for individual object...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Undergraduate Research Online
سال: 2016
ISSN: 2327-7807
DOI: 10.1137/14s013718